Description: 用C语言实现哈夫曼编码对文件进行压缩,并没有通过类来实现,只是用标准的C语言中结构实现的,代码内部说明比较详细,具体可以看代码,包括对文件的编码也解码.-C language of the document Huffman coding compression, and not through the categories to fruition, but the standard C language structure to achieve, and the internal code note in greater detail, the specific code can be seen, including the encoding of the document also decoder. Platform: |
Size: 2124 |
Author:陈志德 |
Hits:
Description: 用C语言实现哈夫曼编码对文件进行压缩,并没有通过类来实现,只是用标准的C语言中结构实现的,代码内部说明比较详细,具体可以看代码,包括对文件的编码也解码.-C language of the document Huffman coding compression, and not through the categories to fruition, but the standard C language structure to achieve, and the internal code note in greater detail, the specific code can be seen, including the encoding of the document also decoder. Platform: |
Size: 2048 |
Author:陈志德 |
Hits:
Description: 哈夫曼编码/译码
背景介绍：
利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求这发送端通过一个编码系统对待传数据预先编码，在发送端将传来的数据进行译码（复原）。对于双工信道。每端都需要一个完整的编译码系统。本程序将为这样的信息收发站写一个哈夫曼的编译码系统。
哈夫曼编码/译码：
程序运行步骤：
１、建立哈夫曼树，从键盘输入字符集大小，字符以及频度。
２、对字符进行编码，输出编码结果，分单个句子和整个句子输出，编码导入和导出CodeFile。
３、对哈夫曼码进行翻译。
运行环境： windows XP
语言环境： 简体中文
软件大小： 144 KB
编写工具： Microsoft Visual C++ 6.0
操作环境: MFC-Huffman encoding/decoding background information : Huffman coding used in communication can greatly improve the channel utilization, reduced transmission time, and lower transmission costs. However, this requires that the sender through a coding system for pre-treatment data-coding, the transmitter will be sent for decoding data (recovery). For dual-channel. Each side needs a complete encryption system. This procedure will this information hubs Huffman was one of the encryption system. Huffman encoding/decoding : running steps : one, to establish Huffman tree from the keyboard input character set size, character and frequency. Two of character coding, the output code, a single-sentence and the entire sentence output, Import and export coding CodeFile. Three of the Huffman codes for tra Platform: |
Size: 77824 |
Author:陈又鄂 |
Hits:
Description: [基本要求]
一个完整的系统应具有以下功能：
（1）I：初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree中。
（2）E：编码（Encoding）。利用已建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。
（3）D：译码（Decoding）。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中。
（4）P：印代码文件（Print）。将文件CodeFile以紧凑格式显示在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrin中。
（5）T：印哈夫曼树（Tree printing）。将已在内存中的哈夫曼树以直观的方式（树或凹入表形式）显示在终端上，同时将此字符形式的哈夫曼树写入文件TreePrint中。
[测试数据]
（1）利用下面这道题中的数据调试程序。
某系统在通信联络中只可能出现八种字符，其概率分别为0.25，0.29，0.07，0.08，0.14，0.23，0.03，0.11，试设计哈夫曼编码。
（2）用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”。-[basic requirements] a complete system should have the following functions : (a) I : initialization (Initialization). Reading from the terminal into the HKSCS size n, and n n characters and the right value, the establishment of Huffman tree. it will be stored in documents hfmTree China. (2) E : coding (Encoding). Use has completed the Huffman tree (if not memory, from hfmTree document reads), the document ToBeTran the encoded text, and then the results were CodeFile posting documents. (3) D : Decoding (Decoding). The use of the completed document will Huffman tree CodeFile the code decoding, results were deposited documents TextFile. (4) P : India source document (Print). CodeFile of documents to compact format in the end, every line 50 code. While this form of characters encoded files int Platform: |
Size: 1013760 |
Author:吕夏琴 |
Hits:
Description: 哈夫曼编码在文件压缩中有其独特一点，它的编码方式特殊。在通信领域可以得到应用。本程序使用C++编写，在VC6.0上调试，完成了文件的读取，文件字符的统计，哈夫曼树的建立，哈夫曼编码的实现，文件转换为哈夫曼编码成为压缩文件以及文件从压缩状态进行解码。-Huffman file compression in a unique point, and its special encoding. In communications applications can be. This procedure using C++ Prepared in VC6.0 debug completed documents to read, the document character s statistics, the establishment of Huffman trees, Huffman coding to achieve, the document is converted to become Huffman compressed files and files from the compressed state decoding. Platform: |
Size: 269312 |
Author:罗天银 |
Hits:
Description: 用C语言实现数据结构中的哈弗曼编译器。可以求出n个字符的赫夫曼编码。建立函数输入二叉树，输出其赫夫曼编码。用户输入n个字符在电文中的使用频率（扩大100倍），并输入这n个字符，确定后系统给出这n个字符的赫夫曼编码。-With the C language data structures Havermann compiler. You can find the n-character Huffman encoding. The establishment of a function input binary tree, the output of its Huffman coding. User input n characters in the message in the use of frequencies (expanded 100-fold), and enter the n characters, and determined the system gives the n-character Huffman encoding. Platform: |
Size: 1024 |
Author:常非 |
Hits:
Description: 1.C或 C++；
2.从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树并将它存于文件hfmTree中.将已在内存中的哈夫曼树以直观的方式（比如树）显示在终端上；
3.利用已经建好的哈夫曼树（如不在内存，则从文件htmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中，并输出结果，将文件CodeFile以紧凑格式先是在终端上，每行50个代码。同时将此字符形式的编码文件写入文件CodePrint中。
4.利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile中，并输出结果。
-1.C, or C++ 2. Read from the terminal into the character set size n, as well as the n character and the n-weights, the establishment of Huffman tree and it is stored in the file in hfmTree. Will have been in memory of the Huffman tree in an intuitive way (such as tree) shows the terminal 3. the use of the Huffman tree has been built (eg, not in memory, read from the file into the htmTree), in the body of the document ToBeTran encoded, and then The results stored in CodeFile file, and output the file to a compact format CodeFile first in the terminal, every line of code 50. At the same time the form of this character encoding of the file write to a file CodePrint. 4. The use of the Huffman tree has been built CodeFile file in the code decoding results stored in the file TextFile, and output. Platform: |
Size: 2048 |
Author:cyahafa |
Hits:
Description: 从键盘输入两个矩阵,输出这两个矩阵和这两个矩阵相乘的矩阵,图书管理系统的一小部分 要求能 登陆 注册 推出 登陆要有次数限制（失败三次退出程序等），注册信息要求写入到文本文件里保存,已知圆半径r=2.5 圆柱高h=4,求圆的周长，面积，圆球体积，圆柱体积，用cin输入要计算的项目，然后输出计算结果，输入输出时要有文字提示,求1！+2！。。。+10！c语言代码,贪吃蛇游戏的C语言代码,求几个带权字符的哈夫曼编码,本打字游戏可进行英文，其它字符和全部字符的打字训练，每次训练若干个字符并进行打字时间，速度，正确率的统计显示,数值分析的龙贝格求积代码(C语言),以足球,篮球,羽毛球.性别.为内容设置checkbox,raidobutton.并且设置确定跟退出按钮,确定时候弹出消息框显示出你所选的checkbox,raidobutton内容,建立数据库，创建表，进行简单的查询，删除，修改即可，这些事件是点击按钮时发生的,Checkbox ,RADIONBUTTON,的简单事例代码,要求确定返回一些关于这些对象的内容 ,DialogBoxSquareFigureTranscriptExitframe的实例源代码.
-From the keyboard input two matrices, the output of these two matrices and a matrix of these two matrices, library management system, a small portion of requests can log landing should be introduced limiting the number of registration (failed three out of Procedure, etc.), registration information requirements write to a text file saved, known radius r = 2.5 cylindrical high-h = 4, seeking circumference of a circle, area, sphere volume, cylinder volume, with the cin input to calculate the project, and then output the calculation results, input output should be text prompts, seek a!+2! . . .+10! c language code, Snake game C language code, the right to seek a few characters with Huffman encoding, this game can be typed in English, other characters and all characters typing training, each training session and conduct a number of characters typed time, speed, accuracy statistics, numerical analysis of the Romberg quadrature codes (C language), to football, basketball, badminton. sex. for Platform: |
Size: 16384 |
Author:wangdongdong |
Hits:
Description: 严蔚敏 数据结构(c语言版)中最优二叉树(赫夫曼树)赫夫曼编码 c语言实现-YAN Wei-min data structure (c-language version) in the optimal binary tree (Huffman tree) Huffman encoding c language Platform: |
Size: 2048 |
Author:kyc |
Hits:
Description:
第一章作业：
用C语言或者VC，VB，Matlab或其他语言完
成如下实验：
1）打开一个BMP文件
2）将其局部区域的灰度值进行改变
3）另存为一个新的BMP文件
要求显示出原BMP图像和新BMP图像。
1。打开一幅图像，添加椒盐、高斯噪声，然后使用邻域平均法、中值滤波法、K邻近平均法进行平滑。
2。打开一幅图像，利用Roberts梯度法、Sobel算子和拉普拉斯算子进行锐化，并比较结果。
第五章作业
编写一个程序，对输入的图像进行哈夫曼编码，显示原图像的熵、编码后的平均码字长度、并能够根据编码重建出图像。
在图像中生成一个矩形，然后用模板匹配法找出矩形位置。使用SSDA或改进SSDA法。
第五章作业
编写一个程序，对输入的图像进行哈夫曼编码，显示原图像的熵、编码后的平均码字长度、并能够根据编码重建出图像。
-Chapter operations: in C or VC, VB, Matlab or other languages to complete the following experiment: 1) open a BMP file 2) the gray value of its local area to change 3) Save as a new requirements display BMP files the original BMP image and the new BMP image. 1. Open an image, add salt and pepper, Gaussian noise, and then use the neighborhood average, median filtering, K adjacent average smoothing. 2. Open the image using the Roberts gradient, Sobel operator and Laplacian sharpening, and compare the results. Chapter operations to write a program, the input image Huffman, display the original image entropy encoded average code word length, and be able to reconstruct the image according to encoding. Generate a rectangle in the image, then use template matching to identify position of the rectangle. Or improved using the SSDA SSDA method. Chapter operations to write a program, the input image Huffman, display the original image entropy encoded average code word length, and be Platform: |
Size: 6144 |
Author:杨智雄 |
Hits:
Description: 在c++环境中实现了huffman编码 并对编码效率进行了计算-In c++ environment to achieve a huffman encoding and coding efficiency was calculated Platform: |
Size: 107520 |
Author:王鹏 |
Hits:
Description: 在电报通讯中，电文是以二进制的0、1序列传送的。字符集中的字符的使用频率是不同的（比如e和t的使用较之q和z要频繁得多），哈夫曼编码可以使得编码的总长最短，从而相同的位长可以传送更多的信息。本程序用c语言来仿真哈夫曼编码的过程，其中运用动态分配数组存储哈夫曼树和动态分配数组存储哈夫曼编码表等c语言常用知识。另外，程序中包含极其详细的注解，十分有利于学习。
-Telegraph communications, the message is binary 0, 1 sequence transmitted. The frequency of use of the character set is different (such as the use of e and t, compared to q, and z is far more frequent), Huffman encoding of the length of the shortest, and thus the same bit length can be sent more information . This procedure to the simulation process of Huffman coding using c language, including the use of dynamically allocated array to store the Huffman tree and dynamically allocated array storage Huffman coding table c language commonly used in knowledge. In addition, the program contains extremely detailed comments, very conducive to learning. Platform: |
Size: 1024 |
Author:Mei |
Hits:
Description: Huffman coding and Compression algorithm c++ code
In computer science and information theory, a Huffman code is an optimal prefix code found using the algorithm developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper A Method for the Construction of Minimum-Redundancy Codes .[1] The process of finding and/or using such a code is called Huffman coding and is a common technique in entropy encoding, including in lossless data compression. The algorithm s output can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). Huffman s algorithm derives this table based on the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. -Huffman coding and Compression algorithm c++ code
In computer science and information theory, a Huffman code is an optimal prefix code found using the algorithm developed by David A. Huffman while he was a Ph.D. student at MIT, and published in the 1952 paper A Method for the Construction of Minimum-Redundancy Codes .[1] The process of finding and/or using such a code is called Huffman coding and is a common technique in entropy encoding, including in lossless data compression. The algorithm s output can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). Huffman s algorithm derives this table based on the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. Platform: |
Size: 2048 |
Author:stoulod |
Hits:
Description: 在visual c++的环境中，通过二叉树实现对字符串进行HUFFMAN编码和译码的功能-In the visual c++ environment, by Binary Tree strings HUFFMAN encoding and decoding functions Platform: |
Size: 1809408 |
Author:李噹噹 |
Hits:
Description: *讨论
* 本PKZIP“通缩”的过程中使用了几个哈夫曼树。越
*共源的值由短比特序列表示。
*
*每个代码树存储在ZIP文件以压缩形式
*这是本身的长度的霍夫曼编码
*所有的代码串（按升序排列按来源值）。
*实际代码串从长度重构
*解压缩过程中，如在“应用指南”中描述
*（APPNOTE.TXT）分布情况的PKWARE的PKZIP的计划的一部分。-* trees.c by Jean-loup Gailly
*
* This is a new version of im_ctree.c originally written by Richard B. Wales
* for the defunct implosion method.
*
* PURPOSE
*
* Encode various sets of source values using variable-length
* binary code trees.
*
* DISCUSSION
*
* The PKZIP deflation process uses several Huffman trees. The more
* common source values are represented by shorter bit sequences.
*
* Each code tree is stored in the ZIP file in a compressed form
* which is itself a Huffman encoding of the lengths of
* all the code strings (in ascending order by source values).
* The actual code strings are reconstructed the lengths in
* the UNZIP process, as described in the application note
* (APPNOTE.TXT) distributed as part of PKWARE s PKZIP program. Platform: |
Size: 11264 |
Author:ShichaoLiang |
Hits:
Search - huffman encoding in c